#include <stdio.h>
#include <stdlib.h>

typedef struct BSTBinaryTree
{
    int data;
    BSTBinaryTree *lchild, *rchild;
} BiTNode, *BiTree;

bool BST_Insert(BiTree &T, int e)
{
    if (!T)
    {
        T = (BiTNode*)malloc(sizeof(BiTNode));
        T->data = e;
        T->lchild = NULL;
        T->rchild = NULL;
        return true;
    }
    else if (e == T->data)
        return 0;
    else if (e < T->data)
        return BST_Insert(T->lchild, e);
    else
        return BST_Insert(T->rchild, e);
}
